The Mathematics of Diagrammatic Logical Systems

نویسنده

  • Gem Stapleton
چکیده

The focus of my PhD was on spider diagrams and constraint diagrams. Constraint diagrams are a visual language for expressing logical statements. The spider diagram language forms a fragment of the constraint diagram language. I developed two diagrammatic reasoning systems. The first of these, based on spider diagrams, directly extends previous work. The second system is based on the more expressive constraint diagram notation and is a restricted form of the language introduced by Kent. I formalized the syntax and semantics of this restricted constraint diagram language, developed reasoning rules and proved soundness and completeness results. I demonstrated that the spider diagram language has the same expressive power as monadic first order logic with equality.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequent Calculus for Euler Diagrams

Proof systems play a major role in the formal study of diagrammatic logical systems. Typically, the style of inference is not directly comparable to traditional sentential systems, to study the the diagrammatic aspects of inference. In this work, we present a proof system for Euler diagrams with shading in the style of sequent calculus. We prove it to be sound and complete. Furthermore we outli...

متن کامل

Reasoning with Diagrams: Final Report

The standard notation for modelling software systems is the Unified Modelling Language (UML). This consists of a suite of mainly diagrammatic notations. However, UML’s constraint language, OCL, is entirely textual, making the notation less accessible to practitioners. The Reasoning with Diagrams project aims to build the foundation for more accessible notations for practitioners, building on an...

متن کامل

Boundary Logic and Alpha Existential Graphs

Peirce's Alpha Existential Graphs (AEG) is combined with Spencer Brown's Laws of Form to create an algebraic diagrammatic formalism called boundary logic. First, the intuitive properties of configurations of planar nonoverlapping closed curves are viewed as a pure boundary mathematics, without conventional interpretation. Void representational space provides a featureless substrate for boundary...

متن کامل

Geometric proof checking with diagrams

The paper presents an account of the diagrammatic arguments of Euclid’s Elements as an example of a proof checking process that is guided by specific mathematical concepts rather than universal, abstract logical rules.

متن کامل

Syntactic Variety in Boundary Logic

Boundary logic is a formal diagrammatic system that combines Peirce's Entitative Graphs with Spencer Brown's Laws of Form. Its conceptual basis includes boundary forms composed of non-intersecting closed curves, voidsubstitution (deletion of irrelevant structure) as the primary mechanism of reduction, and spatial pattern-equations that define valid transformations. Pure boundary algebra, free o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005